Update Postulates without Inertia
نویسندگان
چکیده
Starting from Katsuno and Mendelzon postulates, a new set of postulates which is minimal and complete has been deened, these postulates characterize an update operator. The update operator class which is obtained is larger than Katsuno and Mendelzon's one, since it includes updating operators which are not inert, and which allow for the existence of unreachable states. The main property is that every update operator satisfying this new set of postulates admits an underlying ranked transition graph. The rank-ordering of its transitions has not to be faithful as in Katsuno and Mendelzon system.
منابع مشابه
On Persistent Semantics for Knowledge
Katsuno and Mendelzon suggested eight postulates for characterizing the semantics of update where the principle of minimal change is embedded [Katsuno and Mendelzon, 1991a]. In this paper we propose a new method for knowledge base update based on persistence. We examine the relations between the two di erent update semantics by investigating the satis ability of Katsuno and Mendelzon's update p...
متن کاملPropositional Belief Base Update and Minimal Change
In this paper we examine ten concrete propositional update operations of the literature. We start by completely characterizing their relative strength and their computational complexity. Then we evaluate the competing update operations w.r.t. the postulates proposed by Katsuno and Mendelzon. It turns out that the majority violates most of the postulates. We argue that all violated postulates ar...
متن کاملCompositional Belief Update
We propose an update operator for modifying a knowledge base. The approach differs from other belief change operators in that the definition of the operator is compositional with respect to the sentence to be added. The goal is to provide an update operator that is intuitive, in that its definition is based on a recursive decomposition of the update sentence’s structure, and that may be reasona...
متن کاملIntertranslating Counterfactuals and Updates
We recall that the Ramsey Rule can be seen as axiomatising the relationship of inverse accessibility relations which exists between the notions of update and counterfactual conditional. We use this fact to translate between postulates for updates and postulates for counterfactuals. Thus, Katsuno/Mendelzon's postulates U1{U8 are translated into counterfactual postulates C1{C8 (theorem 6), and ma...
متن کاملUpdating Knowledge Bases Using a Persistent Set Approach
Propositional knowledge base updates have been widely studied recently. Kat-suno and Mendelzon suggested eight postulates for characterizing the semantics of update where the principle of minimal change is embedded 5]. In this paper we propose a new method for knowledge base update called the persistent set approach (PSA). We examine the relations between the two diierent update semantics by in...
متن کامل